Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
نویسندگان
چکیده
منابع مشابه
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
We present computational results of an implementation based on the fixed parameter tractability (FPT) approach for biplanarizing graphs. These results show that the implementation can efficiently minimum biplanarizing sets containing up to about 18 edges, thus making it comparable to previous integer linear programming approaches. We show how our implementation slightly improves the theoretical...
متن کاملA faster fixed parameter algorithm for two-layer crossing minimization
We give an algorithm that decides whether the bipartite crossing number of a given graph is at most k. The running time of the algorithm is upper bounded by 2 + n, where n is the number of vertices of the input graph, which improves the previously known algorithm due to Kobayashi et al. (TCS 2014) that runs in 2 log +n time. This result is based on a combinatorial upper bound on the number of t...
متن کاملTwo-Layer Planarization in Graph Drawing
We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a given two-layer graph. Depending on the number of layers in which the vertices can be permuted freely, that is, zero, one or two, di erent versions of the problems arise. The latter problem was already investigated in [11] using ...
متن کاملTwo-Layer Planarization: Improving on Parameterized Algorithmics
A bipartite graph is biplanar if the vertices can be placed on two parallel lines in the plane such that there are no edge crossings when edges are drawn as straight-line segments connecting vertices on one line to vertices on the other line. We study two problems: • 2-Layer Planarization: can k edges be deleted from a given graph G so that the remaining graph is biplanar? • 1-Layer Planarizati...
متن کاملTwo-Layer Planarization Parameterized by Feedback Edge Set
Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by removing at most k edges. Since transforming G into a forest of caterpillar trees requires breaking every cycle, the size f of a minimum feedback edge set is a natural parameter with f ≤ k. We improve on previous fixed-parameter tract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2005
ISSN: 1526-1719
DOI: 10.7155/jgaa.00103